Extended Process Rewrite Systems: Expressiveness and Reachability
نویسندگان
چکیده
We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less expressive up to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Further we show our main result that the reachability problem for PRS extended with a so called weak finite state unit is decidable.
منابع مشابه
Preliminary Proceedings of the 8 th International Workshop on Expressiveness in Concurrency EXPRESS ’ 01 Aalborg , Denmark , August 20 , 2001
We show how the tree-automata techniques proposed by Lugiez and Schnoebelen apply to the reachability analysis of RPPS systems. Using these techniques requires that we express the states of RPPS systems in a tailor-made process rewrite system where reachability is a relation recognizable by nite tree-automata.
متن کاملReachability is decidable for weakly extended process rewrite systems
Process Rewrite Systems (PRS) are widely accepted as a formalism for the description of infinite-state systems. It is known that the reachability problem for PRS is decidable. The problem becomes undecidable when PRS are extended with a finitestate control unit. In this paper we show that the problem remains decidable when PRS are extended with a weak (i.e. acyclic except for self-loops) finite...
متن کاملProcess Rewrite Systems
Many formal models for in nite-state concurrent systems are equivalent to special classes of rewrite systems. We classify these models by their expressiveness and de ne a hierarchy of classes of rewrite systems. We show that this hierarchy is strict with respect to bisimulation equivalence. The most general and most expressive class of systems in this hierarchy is called Process Rewrite Systems...
متن کاملReachability is Decidable for Ground AC Rewrite Systems
The reachability problem for ground associative-commutative (AC) rewrite systems is decidable. We show that ground AC rewrite systems are equivalent to Process Rewrite Systems (PRS) for which reach-ability is decidable 4]. However, the decidability proofs for PRS are cumbersome and thus we present a simpler and more readable proof in the framework of ground AC rewrite systems. Moreover, we show...
متن کاملOn Computing Reachability Sets of Process Rewrite Systems
We consider the problem of symbolic reachability analysis of a class of term rewrite systems called Process Rewrite Systems (PRS). A PRS can be seen as the union of two mutually interdependent sets of term rewrite rules: a prefix rewrite system (or, equivalently, a pushdown system), and a multiset rewrite system (or, equivalently, a Petri net). These systems are natural models for multithreaded...
متن کامل